A Calculus of Explicit Substitutions Which Preserves Strong Normalisation

نویسندگان

  • Daniel BRIAUD
  • Pierre LESCANNE
  • Z. Benaissa
  • D. Briaud
  • P. Lescanne
چکیده

Explicit substitutions were proposed by Abadi, Cardelli, Curien, Hardin and LLvy to internalise substitutions into-calculus and to propose a mechanism for computing on substitutions. is another view of the same concept which aims to explain the process of substitution and to decompose it in small steps. It favours simplicity and preservation of strong normalisation. This way, another important property is missed, namely connuence on open terms. In spirit, is closely related to another calculus of explicit substitutions proposed by de Bruijn and called C. In this paper, we introduce , we present C in the same framework as and we compare both calculi. Moreover, we prove properties of ; namely correctly implements reduction, is connuent on closed terms, i.e., on terms of classical-calculus and on all terms that are derived from those terms, and nally preserves strong normalisation in the following sense: strongly normalising terms are strongly normalising.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Calculus of Explicit Substitutions Which Preserves Strong Normalisation , a Calculus of Explicit Substitutions Which Preserves Strong Normalisation

Explicit substitutions were proposed by Abadi, Cardelli, Curien, Hardin and LLvy to internalise substitutions into-calculus and to propose a mechanism for computing on substitutions. is another view of the same concept which aims to explain the process of substitution and to decompose it in small steps. is simple and preserves strong normalisation. Apparently that important property cannot stay...

متن کامل

Extending a -calculus with Explicit Substitution Which Preserves Strong Normalisation into a Connuent Calculus on Open Terms

The last fteen years have seen an explosion in work on explicit substitution, most of which is done in the style of the-calculus. In (Kamareddine & R os, 1995a), we extended the-calculus with explicit substitutions by turning de Bruijn's meta-operators into object-operators ooering a style of explicit substitution that diiers from that of. The resulting calculus, s, remains as close as possible...

متن کامل

lambda-nu, A Calculus of Explicit Substitutions which Preserves Strong Normalisation

Explicit substitutions were proposed by Abadi, Cardelli, Curien, Hardin and Lvy to internalise substitutions into λ-calculus and to propose a mechanism for computing on substitutions. λυ is another view of the same concept which aims to explain the process of substitution and to decompose it in small steps. It favours simplicity and preservation of strong normalisation. This way, another import...

متن کامل

Explicit substitutions for the - calculus ?

The-calculus is a-calculus with a control-like operator whose reduction rules are closely related to normalisation procedures in classical logic. We introduce exp, an explicit substitution calculus for , and study its properties. In particular, we show that exp preserves strong normalisation, which provides us with the rst example {moreover a very natural one indeed{ of explicit substitution ca...

متن کامل

Calculi of Generalised -Reduction and Explicit Substitutions: The Type Free and Simply Typed Versions

Extending the-calculus with either explicit substitution or generalised reduction has been the subject of extensive research recently and still has many open problems. This paper is the rst investigation into the properties of a calculus combining both generalised reduction and explicit substitutions. We present a calculus, gs, that combines a calculus of explicit substitution, s, and a calculu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993